Public Key Cryptosystem Based on Singular Matrix

The algorithms such as RSA, ElGamal and ECC work on integers. Commutative operations integer multiplication leave these vulnerable to attack by eavesdroppers. For this reason, experts develop the concept of non-commutative algebra in public key cryptosystem adding properties groups, semirings, semiring division, matrices matrix decomposition. However, generating process some cryptosystems is quite complicated carry out. Therefore, previous research, Liu used nonsingular form a simpler cryptosystem. eavesdroppers use inverse construct private key. As result, still attacks. we singular modify build proposed study. This study indicates that can be results also show algorithm only uses ordinary (without using power operations), so it not too complicated. Furthermore, works over integers possible brute force trials are endless. cannot attacked inversion because matrix.
 HIGHLIGHTS
 
 Public commutative eavesdropping attacks
 cryptosystem
 inversion